The Graceful Coalescence of Alpha Cycles
نویسندگان
چکیده
منابع مشابه
Mixing times for random k-cycles and coalescence-fragmentation chains
Let Sn be the permutation group on n elements, and consider a random walk on Sn whose step distribution is uniform on k-cycles. We prove a well-known conjecture that the mixing time of this process is (1/k)n logn, with threshold of width linear in n. Our proofs are elementary and purely probabilistic, and do not appeal to the representation theory of Sn. CMS Wilberforce Rd., Cambridge Universit...
متن کاملAn Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles
In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and 1 n − edge is odd graceful, and the cycle graph m C with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper, firstly, we studied the graph m n C P ∪ when 4, 6,8,10 m = and then we proved that the graph m n C P ∪ is odd graceful if m is even. Finall...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملThe Influence of Bicomponent Mixed Surfactants on Drop/Interface Coalescence
Effects of binary mixtures of ionic/nonionic (sodium dodecyl sulfate/2-heptanol or 1-decanol) and nonionic/nonionic surfactants (2-heptnol/1-decanol) on drop/interface coalescence of water drops in a continuous n-heptane phase were examined. The drop size reduced appreciably and the multi-step coalescence was suppressed finally as the concentration of each of the constituting components</em...
متن کاملGraceful and odd graceful labeling of some graphs
In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and the shadow graph of bistar Bn,n admit odd graceful labeling.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Advanced Mathematical Sciences
سال: 2019
ISSN: 2651-4001
DOI: 10.33434/cams.505485